Intersections of maximal $L\sb{n}$ sets
نویسندگان
چکیده
منابع مشابه
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2 with (k, r)-bounded intersections, i.e. in which the intersection of any k distinct hyperedges has size at most r. We consider the problem MIS(A, I): given a hypergraph A and a subfamily I ⊆ I(A), of its maximal independent sets (MIS) I(A), either extend this subfamily by constructing a new MIS...
متن کاملSome results on maximal open sets
In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.
متن کاملIntersections of Shifted Sets
We consider shifts of a set A ⊆ N by elements from another set B ⊆ N, and prove intersection properties according to the relative asymptotic size of A and B. A consequence of our main theorem is the following: If A = {an} is such that an = o(n k/k−1), then the k-recurrence set Rk(A) = {x | |A∩ (A+ x)| > k} contains the distance sets of some arbitrarily large finite sets.
متن کاملIntersections of Sets of Distance
We isolate conditions on the relative asymptotic size of sets of natural numbers A,B that guarantee a nonempty intersection of the corresponding sets of distances. Such conditions apply to a large class of zero density sets. We also show that a variant of Khintchine’s Recurrence Theorem holds for all infinite sets A = {a1 < a2 < . . .} where ann n3/2.
متن کاملMaximal Sets of Factors
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These factors at times satisfy additional structural constraints, such as being connected, or such as requiring each component of each factor to be isomorphic. Each set of factors occurs in some natural family of graphs, including complete graphs and complete multipartite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1970
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1970-0253153-3